The ∆ 02 Turing degrees : Automorphisms and Definability
نویسندگان
چکیده
We prove that the ∆2 Turing degrees have a finite automorphism base. We apply this result to show that the automorphism group of DT (≤ 0′) is countable and that all its members have arithmetic presentations. We prove that every relation on DT (≤ 0′) induced by an arithmetically definable degree invariant relation is definable with finitely many ∆2 parameters and show that rigidity for DT (≤ 0′) is equivalent to its biinterpretability with first order arithmetic.
منابع مشابه
Definability, automorphisms, and dynamic properties of computably enumerable sets
We announce and explain recent results on the computably enumerable (c.e.) sets, especially their definability properties (as sets in the spirit of Cantor), their automorphisms (in the spirit of FelixKlein’sErlanger Programm), their dynamic properties, expressed in terms of how quickly elements enter them relative to elements entering other sets, and theMartin Invariance Conjecture on their Tur...
متن کاملThe ∆2 Turing Degrees: Automorphisms and Definability
We prove that the ∆2 Turing degrees have a finite automorphism base. We apply this result to show that the automorphism group of DT (≤ 0′) is countable and that all its members have arithmetic presentations. We prove that every relation on DT (≤ 0′) induced by an arithmetically definable degree invariant relation is definable with finitely many ∆2 parameters and show that rigidity for DT (≤ 0′)...
متن کاملDiscontinuous Phenomena and Turing Definability
We discuss the relationship between discontinuity and definability in the Turing degrees, with particular reference to degree invariant solutions to Post’s Problem. Proofs of new results concerning definability in lower cones are outlined.
متن کاملTuring degrees of hypersimple relations on computable structures
Let A be an infinite computable structure, and let R be an additional computable relation on its domain A. The syntactic notion of formal hypersimplicity of R on A, first introduced and studied by G. Hird, is analogous to the computability-theoretic notion of hypersimplicity of R on A, given the definability of certain effective sequences of relations on A. Assuming that R is formally hypersimp...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کامل